Optimal Routing Path Calculation for SDN using Genetic Algorithm
AUTHORS
Man Soo Han,Dept. Information and Communications, Mokpo National Univ., Republic of Korea
ABSTRACT
Path computation element (PCE) is a network entity that makes a calculation for the best routing path between a source node and a destination node in networks. It is a key technology to support virtualization of software defined network (SDN) and network function virtualization (NFV) for which packet processing power of virtual network nodes as well as bandwidth between them should be considered as a major parameter for the routing path calculation. However, current analytic algorithms including Dijkstra widely used can’t be applicable to some critical cases due to non-linear characteristic of parameters in which both link and performance costs are considered as parameters. This paper addresses that the current shortest path first algorithms are limited to a linear metric, and proposes a new genetic algorithm (GA) to support a non-linear metric for both link and performance costs.
KEYWORDS
PCE, genetic algorithm, shortest path, SDN
REFERENCES
[1] Andreas Fischer, Juan Felipe Botero, Michael Till Beck, Hermann de Meer, and Xavier Hesselbach, Virtual Network Embedding: A Survey, IEEE COMMUNICATIONS SURVEYS & TUTORIALS, vol.15, NO. 4, FOURTH QUARTER (2013)(CrossRef)(Google Scholar)
[2] Francesco Paolucci, Filippo Cugini, Alessio Giorgetti, Nicola Sambo, and Piero Castoldi, A Survey on the Path Computation Element (PCE) Architecture, IEEE COMMUNICATIONS SURVEYS & TUTORIALS, vol.15, NO. 4, FOURTH QUARTER (2013)(CrossRef)(Google Scholar)
[3] Ashraf A. Shahin, Memetic Elitist Pareto Evolutionary Algorithm for Virtual Network Embedding, Computer and Information Science, vol.8, no. 5, pp.73-88. (2015)(CrossRef)(Google Scholar)
[4] Zhang, Z., Cheng, X., Su, S., Wang, Y., Shuang, K., and Luo, Y., A unified enhanced particle swarm optimization-based virtual network embedding algorithm, Int. J. Communication Systems, vol.26, no. 8, pp.1054–1073, (2013)(CrossRef)(Google Scholar)
[5] I. Fajjari, N. Aitsaadi, G. Pujolle, and H. Zimmermann, VNE-AC: Virtual Network Embedding Algorithm Based on Ant Colony Metaheuristic, 2011 IEEE International Conference on Communications (ICC), pp.1-6, (2011)(CrossRef)(Google Scholar)
[6] Bilal Gonen, Genetic Algorithm Finding the Shortest Path in Networks, (2008)
[7] D. Gladwin, P. Stewartb and J. Stewart, A Controlled Migration Genetic Algorithm Operator for Hardware-in-the-Loop Experimentation, Engineering Applications of Artificial Intelligence, vol.24, no. 4, (2011)(CrossRef)(Google Scholar)
[8] Shengxiang Yang, Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems, Workshops on Applications of Evolutionary Computation, pp.627-636, (2007)(CrossRef)(Google Scholar)
[9] Chang Wook Ahn and R. S. Ramakrishna, A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations, IEEE Transactions on Evolutionary Computation, vol.6, no.6, (2002)(CrossRef)(Google Scholar)
[10] Hui Cheng and Shengxiang Yang, Multi-population Genetic Algorithms with Immigrants Scheme for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks, European Conference on the Applications of Evolutionary Computation, pp.562-571, (2010)(CrossRef)(Google Scholar)
CITATION
COPYRIGHT
© 2018 Han Man Soo. Published by Global Vision Press. This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CCBY4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.